A customized low-rank prior model for structured cartoon–texture image decomposition

The mathematical characterization of the texture component plays an instrumental role in image decomposition. In this paper, we are concerned with a low-rank texture prior based cartoon–texture image decomposition model, which utilizes a total variation norm and a global nuclear norm to characterize the cartoon and texture components, respectively. It is promising that our decomposition model is not only extremely simple, but also works perfectly for globally well-patterned images in the sense that the model can recover cleaner texture (or details) than the other novel models. Moreover, such a model can be easily reformulated as a separable convex optimization problem, thereby enjoying a splitting nature so that we can employ a partially parallel splitting method (PPSM) to solve it efficiently. A series of numerical experiments on image restoration demonstrate that PPSM can recover slightly higher quality images than some existing algorithms in terms of taking less iterations or computing time in many cases.     

浅渍法发酵豇豆的工艺优化

以具有降解亚硝酸盐功能的植物乳杆菌（Lactobacillus plantarum）SD-7和具有优良抗氧化能力的植物乳杆菌（Lactobacillus plantarum）FM-LP-9为复合发酵剂（1∶1），采用浅渍法发酵豇豆。以硬度和感官评分为考察指标，通过单因素试验及响应面试验研究复合发酵剂接种量、发酵温度和发酵时间对浅渍法发酵豇豆品质的影响。结果表明，最佳发酵工艺条件为发酵温度25 ℃，接种量5%，发酵时间125 h，在此优化条件下，得到的浅渍法发酵豇豆硬度为47.31 N，感官评分为90.98分，香气浓郁、口感脆嫩。     

Pattern design and optimization of yarn-dyed plaid fabric using isolation niche genetic algorithm and rough set theory

Under the circumstance of perceptual consumption, it is still challenging to grasp consumer's emotions and demands due to the large search space, diversified preferences, and easy fatigue of consumers. To reduce user fatigue and enlarge search space, a novel method was presented to design and optimize the pattern of yarn-dyed plaid fabric using the isolation niche genetic algorithm and rough set theory. Each pattern was encoded as a chromosome based on the real number code. The population was initialized and evolved using INGA to maintain the diversity. The rough set theory was adopted as the fitness function of isolation niche genetic algorithm to extract the consumer's demands. After multiple evolutions, a large set of practical patterns of the yarn-dyed plaid fabric are obtained. Experiments were carried out by 24 testers of different ages and genders. The results prove that the proposed method based on the isolation niche genetic algorithm and rough set theory is feasible and effective, supplying references to the designer.     

An automated treatment planning strategy for highly noncoplanar radiotherapy arc trajectories

Radiation therapy is a technology-driven cancer treatment modality that has experienced significant advances over the last decades, due to multidisciplinary contributions that include engineering and computing. Recent technological developments allow the use of noncoplanar volumetric modulated arc therapy (VMAT), one of the most recent photon treatment techniques, in clinical practice. In this work, an automated noncoplanar arc trajectory optimization framework designed in two modular phases is presented. First, a noncoplanar beam angle optimization algorithm is used to obtain a set of noncoplanar irradiation directions. Then, anchored in these directions, an optimization strategy is proposed to compute an optimal arc trajectory. The computational experiments considered a pool of twelve difficult head-and-neck tumor cases. It was possible to observe that, for some of these cases, the optimized noncoplanar arc trajectories led to significant treatment planning quality improvements, when compared with coplanar VMAT treatment plans. Although these experiments were done in a research environment treatment planning software (matRad), the conclusions can be of interest for a clinical setting: automated procedures can simplify the current treatment workflow, produce high-quality treatment plans, making better use of human resources and allowing for unbiased comparisons between different treatment techniques.     

Towards artificial intelligence at scale in the chemical industry

In the Industry 4.0 era, the chemical industry is embracing broad adoption of artificial intelligence (AI) and machine learning (ML) methods. This article provides a holistic view of how the industry is transforming digitally towards AI at scale. First, a historical perspective on how the industry used AI to aid humans in better decision-making is shown. Then state-of-the-art AI research addressing industrial needs on reliability and safety, process optimization, supply chain, material discovery, and reaction engineering is highlighted. Finally, a vision of the plant of the future is illustrated with critical components of AI-ready culture, model life cycle management, and renewed role of humans in chemical manufacturing.     

Coverage optimization algorithm based on VF-CS in mobile sensor network

A random placement of large-scale sensor network in the outdoor environment often causes low coverage.An area coverage optimization algorithm of mobile sensor network (MSN) based on virtual force perturbation and Cuckoo search (VF-CS) was proposed.Firstly,the virtual force of the sensor nodes within the Thiessen polygon was analyzed based on the partitioning of Voronoi diagram of the monitoring area.Secondly,the force of polygon vertices and neighbor nodes was taken as the perturbation factor for updating the node’s location of the Cuckoo search (CS).Finally,the VF-CS guided the node to move so as to achieve the optimal coverage.The simulation results demonstrate that the proposed algorithm has higher coverage and shorter average moving distance of nodes than the Voronoi diagram based algorithms in literatures.     

A novel multi-objective optimization method: Input values effect on responses (IVER)

In this study, a novel multi-objective optimization method based on the best effect of unique input (independent variable) values on responses (dependent variables) was proposed. The proposed method was compared with optimization using Derringer & Suich function that is still the most used. The comparison was made using the response values measured in real experiments and available in the literature. The advantages of the proposed method such as not needing the polynomial model aiming to predict the response values, no parameter selection problem, being able to offer optimum range instead of single optimum value, being suitable for use with existing experimental designs and being simple and interpretable were demonstrated as a result of comparison. It was also suggested how the proposed method will be effective according to experimental designs, and application for the users' application was presented.     

多铜氧化酶在大肠杆菌中的分泌表达

生物胺是存在于发酵食品中的一类有机物，过量摄入会危害人体健康。多铜氧化酶中的某些酶具有降解多种生物胺的活性，在减控发酵食品中的氨(胺)类危害物方面具有良好的应用前景。研究多铜氧化酶的分泌表达，对酶的特性改造和工业化生产与应用具有重要意义。本研究通过在解淀粉芽孢杆菌来源的多铜氧化酶N端融合信号肽PhoA实现了多铜氧化酶在大肠杆菌中的分泌表达，胞外酶活为69.8 U/L。通过优化诱导条件和酶的分泌确定了多铜氧化酶最优发酵条件为诱导温度25℃、IPTG浓度0.05 mmol/L、诱导时菌体OD600=1.0、诱导6 h后添加150 mmol/L甘氨酸；发酵40 h时胞外多铜氧化酶酶活达到238.1 U/L，是优化前的3.4倍。     

Adaptive Discretization for Computerized Tomography

Two adaptive discretization frameworks are tested for computerized tomography (CT) data reconstruction. Removal of inactive pixels is primary motivation. Efficient and user independent entropy optimized masking is employed for spatial filtering purposes. Density of nodes at high gradient of reconstructed physical property is used as adaptation criterion. An alternative option, independent from noisy projection data and nature of the physical properties, is also discussed. Sensitivity analysis between the uniform and nonuniform (evolved via adaptive route) reconstruction grid reveals the utility of nonuniform grids. Iterative and transform based reconstruction techniques are used. Outcomes are tested successfully on three real world projection data from two different compact CT setups and one commercial high-resolution micro-CT scanner.     

差分准对立学习多目标蚁狮算法

为解决多目标优化问题，对经典的蚁狮算法进行改进，提出了基于差分进化的准对立学习多目标蚁狮算法（DEQOMALO）。该算法针对蚁狮算法易陷入局部最优的不足，一方面，该算法引用差分进化的思想，充分利用种群和精英蚁狮的信息对原算法中蚂蚁个体的位置更新方式进行改进；另一方面采用反向学习策略对蚂蚁种群进行优化，将原种群个体和其准对立个体进行混合并择优作为新的种群，大大增加种群的多样性。选取典型的标准测试函数，将提出的算法与原始蚁狮算法以及其他传统进化策略优化的蚁狮算法进行比较。实验结果表明，改进算法在收敛性和分布性上均有很大程度的提升，在解决双目标优化问题上具有较好的鲁棒性和有效性。